9.2 Minimum Feedback Vertex Set
نویسنده
چکیده
Roughly speaking, the local ratio method works iteratively, and in each iteration it breaks a suitable structure (the local structure) to solve from the residual structure in that iteration. Typically the local structure is an instance that is very easy to solve. The main claim that is required is that the solution to the local structure can be patched with the solution from the next iteration, to get a good solution in the current iteration.
منابع مشابه
Bounds for minimum feedback vertex sets in distance graphs and circulant graphs
For a set D ⊂ Zn, the distance graph Pn(D) has Zn as its vertex set and the edges are between vertices i and j with |i− j| ∈ D. The circulant graph Cn(D) is defined analogously by considering operations modulo n. The minimum feedback vertex set problem consists in finding the smallest number of vertices to be removed in order to cut all cycles in the graph. This paper studies the minimum feedba...
متن کاملMinimum Feedback Vertex Set in k - Dimensional Hypercubes Riccardo
In this paper we nd upper and lower bounds to the size of the feedback vertex set for k-dimensional hypercubes. Given a graph, the minimum feedback vertex set problem consists of nding a subset of vertices of minimum size whose removal induces an acyclic subgraph. The problem is NP-hard for general networks 2], but interesting polynomial solutions have been found for particular
متن کاملFinding a Minimum Feedback Vertex Set in time
We present an O(1.7548) algorithm finding a minimum feedback vertex set in a graph on n vertices.
متن کاملFinding minimum feedback vertex set in bipartite graph
We show that minimum feedback vertex set in a bipartite graph on n vertices can be found in 1.8621 · nO(1) time.
متن کاملFinding a Minimum Feedback Vertex Set in Time O (1.7548n)
We present an O(1.7548) algorithm finding a minimum feedback vertex set in a graph on n vertices.
متن کامل